Periods in missing lengths of rainbow cycles

نویسنده

  • Petr Vojtechovský
چکیده

A cycle in an edge-colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge-colored graph G, define S(G) = {n ≥ 2 | no n-cycle of G is rainbow}. Then S(G) is a monoid with respect to the operation n ◦m = n + m − 2, and thus there is a least positive integer π(G), the period of S(G), such that S(G) contains the arithmetic progression {N + kπ(G) | k ≥ 0} for some sufficiently large N . Given that n ∈ S(G), what can be said about π(G)? Alexeev showed that π(G) = 1 when n ≥ 3 is odd, and conjectured that π(G) always divides 4. We prove Alexeev’s conjecture: Let p(n) = 1 when n is odd, p(n) = 2 when n is divisible by four, and p(n) = 4 otherwise. If 2 < n ∈ S(G) then π(G) is a divisor of p(n). Moreover, S(G) contains the arithmetic progression {N + kp(n) | k ≥ 0} for some N = O(n). The key observations are: If 2 < n = 2k ∈ S(G) then 3n− 8 ∈ S(G). If 16 6= n = 4k ∈ S(G) then 3n− 10 ∈ S(G). The main result cannot be improved since for every k > 0 there are G, H such that 4k ∈ S(G), π(G) = 2, and 4k + 2 ∈ S(H), π(H) = 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Rainbow Trees and Cycles

We derive sufficient conditions for the existence of rainbow cycles of all lengths in edge colourings of complete graphs. We also consider rainbow colorings of a certain class of trees.

متن کامل

On Rainbow Cycles

We prove several results regarding rainbow cycles within edge-colored complete graphs. We refute a conjecture by Ball, Pultr, and Vojtěchovský [BPV05] by showing that if such a coloring does not contain a rainbow n-cycle, where n is odd, then it also does not contain rainbow cycles of all sufficiently large lengths. In addition, we present two examples which demonstrate that this result does no...

متن کامل

On Lengths of Rainbow Cycles

We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr, and Vojtěchovský [BPV05] by showing that if such a coloring does not contain a rainbow cycle of length n, where n is odd, then it also does not contain a rainbow cycle of length m for all m greater than 2n. In additi...

متن کامل

On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles

‎Let G be a graph‎. ‎A 2-rainbow dominating function (or‎ 2-RDF) of G is a function f from V(G)‎ ‎to the set of all subsets of the set {1,2}‎ ‎such that for a vertex v ∈ V (G) with f(v) = ∅, ‎the‎‎condition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled‎, wher NG(v)  is the open neighborhood‎‎of v‎. ‎The weight of 2-RDF f of G is the value‎‎$omega (f):=sum _{vin V(G)}|f(v)|$‎. ‎The 2-rainbow‎‎d...

متن کامل

Effects of different feed restriction periods on the growth and fatty acid compositions in juvenile rainbow trout (Oncorhynchus mykiss)

The aim of this study was to determine the effect of different feed restriction periods on the growth performance as well as the biochemical and fatty acid compositions of fillet in rainbow trout (Oncorhynchus mykiss). Fish with an average initial weight of 64.80±7.41g were used in the study. The trial lasted 60 days and 4 different feeding diets were alternately applied to the fish. The contro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2009